#include <iostream>
#include <algorithm>
using namespace std;
typedef unsigned long long ULL;
const int N = 1e4 + 10, p = 131;
int n;
ULL a[N];
ULL get_hash(string& s)
{
	ULL ret = 0;
	for (int i = 1; i <= s.size(); i++)
	{
		ret = ret * p + s[i - 1];
	}
	return ret;
}
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		string s; cin >> s;
		a[i] = get_hash(s);
	}

	int ret = 1;
	sort(a + 1, a + 1 + n);
	for (int i = 2; i <= n; i++)
	{
		if (a[i] != a[i - 1]) ret++;
	}
	cout << ret << endl;



	return 0;
}
